Definitions | x:A B(x), f(a), left + right, P Q, Q ==f== P, E, {x:A| B(x)} , s = t, x:A. B(x), x:A B(x), x:A. B(x), P & Q, A c B, Q  = f== P, ES, t T, Type, , Dec(P), A, P  Q, False, let x,y = A in B(x;y), t.1, e c e', b, if p:P then A(p) else B fi , [P? f : g], S T, suptype(S; T), {T}, Void |